Path Planning by Multiheuristic Search via Subgoals
نویسنده
چکیده
An efficient path planning algorithm for general 6 degrees of freedom robots is presented in the paper. The path planner is based on multiheuristic A search algorithm with dynamic subgoal generation for rapid escaping from deep local-minimum wells. The algorithm has been implemented as an extension to a robot off-line programming and simulation system for testing. The presented test results demonstrate that the algorithm is practically applicable to path planning for devices of different kinematic structure.
منابع مشابه
Proceedings of the 27th International Symposium on Industrial Robots, CEU, Milan, 1996, 712-726. PATH PLANNING BY MULTIHEURISTIC SEARCH VIA SUBGOALS
An efficient path planning algorithm for general 6 degrees of freedom robots is presented in the paper. The path planner is based on multiheuristic A search algorithm with dynamic subgoal generation for rapid escaping from deep local-minimum wells. The algorithm has been implemented as an extension to a robot off-line programming and simulation system for testing. The presented test results dem...
متن کاملNeural Subgoal Generation using Backpropagation
Building a world model takes exponential computational costs with the number of obstacles. In real world applications are usually many obstacles, possibly changing their positions over time. In order to cope with a changing environment, a solution has to be adaptive. In order to plan complex trajectories, a system that plans hierarchically shows many advantages. In this article we report on res...
متن کاملIdentifying Hierarchies for Fast Optimal Search
For some search problems, the graph is known beforehand and there is time to preprocess the graph to make the search faster. One such example is video games, where one can often preprocess maps before a game is released or while a map is loaded into memory. The data produced by preprocessing should use only a small amount of memory, and, in case they are generated during runtime, preprocessing ...
متن کاملFast Subgoaling for Pathfinding via Real-Time Search
Real-time heuristic search is a standard approach to pathfinding when agents are required to make decisions in a bounded, very short period of time. An assumption usually made in the development and evaluation of real-time algorithms is that the environment is unknown. Nevertheless, in many interesting applications such as pathfinding for automnomous characters in video games, the environment i...
متن کاملSpeeding-Up Any-Angle Path-Planning on Grids
Simple Subgoal Graphs are constructed from grids by placing subgoals at the corners of obstacles and connecting them. They are analogous to visibility graphs for continuous terrain but have fewer edges and can be used to quickly find shortest paths on grids. The vertices of a Simple Subgoal Graph can be partitioned into different levels to create N-Level Subgoal Graphs, which can be used to fin...
متن کامل